Some Properties of Generalized Third Order Pell Numbers

نویسندگان

  • A. G. Shannon
  • C. K. Wong
چکیده

This paper considers some properties of the third order recursive sequence defined by the linear recurrence relation , 2 , 1 , 0 , 3 , 2 3 , 2 , , = ≥ + = − − m n w w w n m n m m n m , with appropriate initial conditions. The present work follows on from the case m = 0 (Shannon et al). Relationships with the well-known sequences of Fibonacci, Lucas and Pell are developed. The motivation for the study was to find analogous results to some of the second order classic identities such as, for example, Simson’s identity and Horadam’s Fibonacci number triples.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE GENERALIZED BINET FORMULA, REPRESENTATION AND SUMS OF THE GENERALIZED ORDER-k PELL NUMBERS

In this paper we give a new generalization of the Pell numbers in matrix representation. Also we extend the matrix representation and we show that the sums of the generalized order-k Pell numbers could be derived directly using this representation. Further we present some identities, the generalized Binet formula and combinatorial representation of the generalized order-k Pell numbers.

متن کامل

The generalized order-k Fibonacci–Pell sequence by matrix methods

In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, thenwe define a new recurrence, which we call generalized order-k F–P sequence. Also we present a systematic investigation of the generalized order-k F–P sequence. We give the generalized Binet formula, some identities and an explicit formula for sums of the generalized order-k F–P sequence by matrix me...

متن کامل

On The Usual Fibonacci and Generalized Order-k Pell Numbers

In this paper, we give some relations involving the usual Fibonacci and generalized order-k Pell numbers. These relations show that the generalized order-k Pell numbers can be expressed as the summation of the usual Fibonacci numbers. We …nd families of Hessenberg matrices such that the permanents of these matrices are the usual Fibonacci numbers, F2i 1; and their sums. Also extending these mat...

متن کامل

On the computing of the generalized order-k Pell numbers in log time

In this paper, we consider the generalized order-k Pell numbers and present an algorithm for computing the sums of the generalized order-k Pell numbers, as well as the Pell numbers themselves. The theoretical basis of using a matrix method for deriving the algorithm is also discussed. 2006 Elsevier Inc. All rights reserved.

متن کامل

Some Basic Properties and a Two-by-Two Matrix Involving the k- Pell Numbers

In this paper we consider the k-Pell numbers sequence and present some properties involving the k-Pell numbers. The theoretical basis of using generating matrices for deriving the explicit formula for the term of order n of the k-Pell numbers sequence and also to get the well-known Cassini’s identity using linear algebra. Mathematics Subject Classification: 11B37, 05A15, 11B83.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014